The dimension of lexicographic sums of partially ordered sets

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tripled partially ordered sets

In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.

متن کامل

On Sums Over Partially Ordered Sets

We establish a general theorem for reducing sums of type ∑ y≥x g(y) where g is a mapping from a partially ordered set into an abelian group. Conclusions concern the Möbius function, the principle of inclusionexclusion, the Tutte polynomial and Crapo’s beta invariant.

متن کامل

Computational aspects of the 2-dimension of partially ordered sets

A well-known method to represent a partially ordered set P (order for short) consists in associating to each element of P a subset of a 7xed set S = {1; : : : ; k} such that the order relation coincides with subset inclusion. Such an embedding of P into 2 (the lattice of all subsets of S) is called a bit-vector encoding of P. These encodings provide an interesting way to store an order. They ar...

متن کامل

On the fractional dimension of partially ordered sets

We use a variety of combinatorial techniques to prove several theorems concerning fractional dimension of partially ordered sets. In particular, we settle a conjecture of Brightwell and Scheinerman by showing that the fractional dimension of a poset is never more than the maximum degree plus one. Furthermore, when the maximum degree k is at least two, we show that equality holds if and only if ...

متن کامل

Sums of lexicographically ordered sets

We consider the problem of determining finite integer sets which are knapsack-solvable in linear time (that is, it is possible to determine in linear time, for any integer b, whether b can be expressed as a sum of distinct elements of that set) and where the largest element is as small as possible. We study the condition that the k-subsets (for fixed k) when lexicographically ordered have incre...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky

سال: 1961

ISSN: 0528-2195

DOI: 10.21136/cpm.1961.117384